A New Modified CMM Modular Exponentiation Algorithm
نویسندگان
چکیده
منابع مشابه
A New Modified CMM Modular Exponentiation Algorithm
Modular exponentiation is fundamental operation in the many cryptosystem such as RSA. This operation is implemented by repeating modular multiplication which is time consuming for large operands. This paper presents a new modified Montgomery modular multiplication algorithm based on multiple bit scan-multiple bit shift technique, sliding window method and signed-digit representation. This new a...
متن کاملAn Efficient Parallel CMM-CSD Modular Exponentiation Algorithm by Using a New Modified Modular Multiplication Algorithm
This paper presents a new modified Montgomery modular multiplication algorithm based on canonical signed-digit (CSD) representation, and sliding window method. In this modified Montgomery modular multiplication algorithm, signed-digit recoding technique is used in order to increase probability of the zero bits. Also sliding window method is used in order to reduce the multiplication steps consi...
متن کاملAn Algorithm for Modular Exponentiation
A practical technique for improving the performance of modular exponentiations (ME) is described. The complexity of the ME algorithm is modular multiplications (MMs), where n is the length of the exponent, requiring an O(n 2) precomputed look-up table size with very small constant of proportionality. The algorithm uses a double-based number system which we introduce in this paper. O n n log ---...
متن کاملEfficient Modular Exponentiation Architectures for RSA Algorithm
-Cryptosystems are used to send confidential messages in secure manner. The most important and efficient type of cryptosystem is RSA. RSA is used in various sectors such as Bank security and Internet protection. One of the various steps involved in RSA is Modular exponentiation, which is used in both Encryption and Decryption. It takes high memory and computation time of algorithm. In order to ...
متن کاملNew Modular Multiplication Algorithms for Fast Modular Exponentiation
A modular exponentiation is one of the most important operations in public-key cryptography. However, it takes much time because the modular exponen-tiation deals with very large operands as 512-bit integers. The modular exponentiation is composed of repetition of modular multiplications. Therefore, we can reduce the execution time of it by reducing the execution time of each modular multiplica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Intelligent Computing Research
سال: 2011
ISSN: 2042-4655
DOI: 10.20533/ijicr.2042.4655.2011.0021